New Bounds for the Dichromatic Number of a Digraph

The chromatic number of a graph $G$, denoted by $\chi(G)$, is the minimum $k$ such that $G$ admits a $k$-coloring of its vertex set in such a way that each color class is an independent set (a set of pairwise non-adjacent vertices). The dichromatic number of a digraph $D$, denoted by $\chi_A(D)$, is the minimum $k$ such that $D$ admits a $k$-coloring of its vertex set in such a way that each color class is acyclic. In 1976, Bondy proved that the chromatic number of a digraph $D$ is at most its circumference, the length of a longest cycle. Given a digraph $D$, we will construct three different graphs whose chromatic numbers bound $\chi_A(D)$. Moreover, we prove: i) for integers $k\geq 2$, $s\geq 1$ and $r_1, \ldots, r_s$ with $k\geq r_i\geq 0$ and $r_i\neq 1$ for each $i\in[s]$, that if all cycles in $D$ have length $r$ modulo $k$ for some $r\in\{r_1,\ldots,r_s\}$, then $\chi_A(D)\leq 2s+1$; ii) if $D$ has girth $g$ and there are integers $k$ and $p$, with $k\geq g-1\geq p\geq 1$ such that $D$ contains no cycle of length $r$ modulo $\lceil \frac{k}{p} \rceil p$ for each $r\in \{-p+2,\ldots,0,\ldots,p\}$, then $\chi_A (D)\leq \lceil \frac{k}{p} \rceil$; iii) if $D$ has girth $g$, the length of a shortest cycle, and circumference $c$, then $\chi_A(D)\leq \lceil \frac{c-1}{g-1} \rceil +1$, which improves, substantially, the bound proposed by Bondy. Our results show that if we have more information about the lengths of cycles in a digraph, then we can improve the bounds for the dichromatic number known until now.Comment: 14 page

Independent sets and non-augmentable paths in generalizations of tournaments

AbstractWe study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting every non-augmentable path (in particular, every longest path). The classes are the arc-local tournament, quasi-transitive, locally in-semicomplete (out-semicomplete), and semicomplete k-partite digraphs. We present results on strongly internally and finally non-augmentable paths as well as a result that relates the degree of vertices and the length of longest paths. A short survey is included in the introduction

k-colored kernels

We study $k$-colored kernels in $m$-colored digraphs. An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K$ of its vertices such that (i) from every vertex $v\notin K$ there exists an at most $k$-colored directed path from $v$ to a vertex of $K$ and (ii) for every $u,v\in K$ there does not exist an at most $k$-colored directed path between them. In this paper, we prove that for every integer $k\geq 2$ there exists a $(k+1)$-colored digraph $D$ without $k$-colored kernel and if every directed cycle of an $m$-colored digraph is monochromatic, then it has a $k$-colored kernel for every positive integer $k.$ We obtain the following results for some generalizations of tournaments: (i) $m$-colored quasi-transitive and 3-quasi-transitive digraphs have a $k$% -colored kernel for every $k\geq 3$ and $k\geq 4,$ respectively (we conjecture that every $m$-colored $l$-quasi-transitive digraph has a $k$% -colored kernel for every $k\geq l+1)$, and (ii) $m$-colored locally in-tournament (out-tournament, respectively) digraphs have a $k$-colored kernel provided that every arc belongs to a directed cycle and every directed cycle is at most $k$-colored

Tournaments with kernels by monochromatic paths

In this paper we prove the existence of kernels by monochromatic paths in m-coloured tournaments in which every cyclic tournament of order 3 is atmost 2-coloured in addition to other restrictions on the colouring ofcertain subdigraphs. We point out that in all previous results on kernelsby monochromatic paths in arc coloured tournaments, certain smallsubstructures are required to be monochromatic or monochromatic with atmost one exception, whereas here we allow up to three colours in two smallsubstructures

On the existence and number of (k+1)(k+1)-kings in kk-quasi-transitive digraphs

Let $D=(V(D), A(D))$ be a digraph and $k \ge 2$ an integer. We say that $D$ is $k$-quasi-transitive if for every directed path $(v_0, v_1,..., v_k)$ in $D$, then $(v_0, v_k) \in A(D)$ or $(v_k, v_0) \in A(D)$. Clearly, a 2-quasi-transitive digraph is a quasi-transitive digraph in the usual sense. Bang-Jensen and Gutin proved that a quasi-transitive digraph $D$ has a 3-king if and only if $D$ has a unique initial strong component and, if $D$ has a 3-king and the unique initial strong component of $D$ has at least three vertices, then $D$ has at least three 3-kings. In this paper we prove the following generalization: A $k$-quasi-transitive digraph $D$ has a $(k+1)$-king if and only if $D$ has a unique initial strong component, and if $D$ has a $(k+1)$-king then, either all the vertices of the unique initial strong components are $(k+1)$-kings or the number of $(k+1)$-kings in $D$ is at least $(k+2)$.Comment: 17 page